A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
نویسندگان
چکیده
منابع مشابه
Strongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. The full version is available on arXiv:1307.680...
متن کاملA Faster Strongly Polynomial Minimum Cost Flow Algorithm
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n (m + n log n)) time. Using a standard transformation, thjis ...
متن کاملA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n EO + n) time, where EO is the time to evaluate f(S) for some S ⊆ V. This improves the previous best strongly polynomial running time by more than a factor of n
متن کاملA Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is NP-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n). The app...
متن کاملA New Much Faster and Simpler Algorithm for Lapack Dgels
We present new algorithms for computing the linear least squares solution to overde-termined linear systems and the minimum norm solution to underdetermined linear systems. For both problems, we consider the standard formulation min kAX ? BkF and the transposed formulation min kA T X ? BkF , i.e, four diierent problems in all. The functionality of our implementation corresponds to that of the L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2020
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3383454